eskimo: EXPERIMENTING SKELETONS ON THE SHARED ADDRESS MODEL

نویسنده

  • MARCO ALDINUCCI
چکیده

We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present eskimo library which represents an attempt to merge the two programming models by introducing skeletons in a shared memory framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

eskimo: Experimenting with Skeletons in the Shared Address Model

We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present the eskimo library which represents an attempt to merge the ...

متن کامل

eskimo: EXPERIMENTING WITH SKELETONS

We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present the eskimo library which represents an attempt to merge the ...

متن کامل

Dynamic shared data in structured parallel programming frameworks

This work originates from the wish to simplify the coding of irregular applications within structured parallel programming environments. In these environments parallelism is exploited by composing “skeletons”, i.e. parallelism exploitation patterns. The skeletal approach has been proved to be effective, at least if application algorithms can be somehow expressed in terms of skeleton composition...

متن کامل

Optimizations on Array Skeletons in a Shared Memory Environment

Mapand fold-like skeletons are a suitable abstractions to guide parallel program execution in functional array processing. However, when it comes to achieving high performance, it turns out that confining compilation efforts to individual skeletons is insufficient. This paper proposes compilation schemes which aim at reducing runtime overhead due to communication and synchronization by embeddin...

متن کامل

Exploring the spatial patterns of three prevalent cancer latent risk factors in Iran; Using a shared component model

Background and aims: The aim of this study was the modeling of the incidence rates of Colorectal, breast and prostate cancers using a shared component model in order to explore the spatial pattern of their shared risk factors (i.e., obesity and low physical activity) affecting on cancer incidence, and also to estimate the relative weight of these shared components. Methods: In this study,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003